Hybrid variable neighbourhood approaches to university exam timetabling
نویسندگان
چکیده
منابع مشابه
Hybrid variable neighbourhood approaches to university exam timetabling
In this paper we propose a variable neighbourhood search (VNS) meta-heuristic [25] for the university examination timetabling problem. In addition to a basic VNS method, we introduce a variety of variants which further improve the quality of the results produced by the technique. We also aim to demonstrate that the proposed technique is capable of producing high quality solutions across a wide ...
متن کاملHybrid Variable Neighborhood Approaches to Exam Timetabling
A very important factor for the success of a local search is the neighborhood employed during the search. Variable Neighborhood Search (VNS) algorithms [5] employ more than one neighborhood and change the employment of these neighborhoods during the search. It provides a very effective way of escaping from local optima and is both versatile and successful compared to other local search techniqu...
متن کاملAn Investigation of Variable Neighbourhood Search for University Course Timetabling
The university course timetabling problem consists, in essence, of assigning lectures to a specific timeslot and room. The goal is to satisfy as many soft constraints as possible while constructing a feasible schedule. In this paper, we present a variable neighbourhood search approach with an exponential monte carlo acceptance criteria. This heuristic search approach is based on random-descent ...
متن کاملHybrid Variable Neighborhood HyperHeuristics for Exam Timetabling Problems
Exam timetabling is one of the most important administrative activities in universities (e.g. [4], [8], and [19]). Such problems have been the subject of significant research effort across Artificial Intelligence research and Operational Research since the 1960s. A general exam timetabling problem consists of assigning a set of exams into a limited number of timeslots while satisfying a set of ...
متن کاملTwo neighbourhood approaches to the timetabling problem
It is well known that any search algorithm needs for certain parts to be problem specific. It is very important the way these parts are implemented. A fine tuning of parameters will never balance a bad definition of the solution set, of the neighbourhood or the cost function. In this paper we try to compare two well known neighbourhood operators applied to the timetabling problem. Tests were ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2010
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2010.01.044